introducing a novel mathematical model for school vehicle routing problem and proposing a new algorithm to solve it

Authors

جعفر رزمی

استاد دانشکده مهندسی صنایع و سیستم ها-پردیس دانشکده های فنی-دانشگاه تهران ماریا یوسفی

دانش آموخته کارشناسی ارشد دانشکده مهندسی صنایع و سیستم ها-پردیس دانشکده های فنی-دانشگاه تهران

abstract

this research presents and solves a new mathematical model for school bus routing problem (sbrp). sbrp is a specific case of vehicle routing problem (vrp). despite prevalent models, this model includes location and routing simultaneously. besides, the vehicles are non-homogenous. in addition, instead of locating schools which are the depots, we consider locating bus stops that are mentioned 'customers' in the simple location routing problem (lrp). this problem itself has led to a change in sub-tour elimination constraint. in contrast to the other articles we solve location and routing simultaneously. in one of these models, students related to different schools can receive service by same station and in other models each school have specific stations. to solve this model, we proposed a meta-heuristic scatter search (ss) algorithm. afterward, we coded the model by gams software. finally the results derived from ss algorithm are compared with results derived from gams. consequently we figured out that ss algorithm produces results in more reasonable time with acceptable errors.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

A novel heuristic algorithm for capacitated vehicle routing problem

The vehicle routing problem with the capacity constraints was considered in this paper. It is quite difficult to achieve an optimal solution with traditional optimization methods by reason of the high computational complexity for large-scale problems. Consequently, new heuristic or metaheuristic approaches have been developed to solve this problem. In this paper, we constructed a new heuristic ...

full text

A New Mathematical Model for the Green Vehicle Routing Problem by Considering a Bi-Fuel Mixed Vehicle Fleet

This paper formulates a mathematical model for the Green Vehicle Routing Problem (GVRP), incorporating bi-fuel (natural gas and gasoline) pickup trucks in a mixed vehicle fleet. The objective is to minimize overall costs relating to service (earliness and tardiness), transportation (fixed, variable and fuel), and carbon emissions. To reflect a real-world situation, the study considers: (1) a co...

full text

A Novel Heuristic Algorithm Based on Clark and Wright Algorithm for Green Vehicle Routing Problem

A significant portion of Gross Domestic Production (GDP) in any country belongs to the transportation system. Transportation equipment, in the other hand, is supposed to be great consumer of oil products. Many attempts have been assigned to the vehicles to cut down Greenhouse Gas (GHG). In this paper a novel heuristic algorithm based on Clark and Wright Algorithm called Green Clark and Wright (...

full text

Proposing a Constrained-GSA for the Vehicle Routing Problem

In the past decades, vehicle routing problem (VRP) has gained considerable attention for its applications in industry, military, and transportation applications. Vehicle routing problem with simultaneous pickup and delivery is an extension of the VRP. This problem is an NP-hard problem; hence finding the best solution for this problem which is using exact method, take inappropriate time, and th...

full text

A mathematical model for vehicle routing and scheduling problem with cross-docking by considering risk

Today, many companies after achieving improvements in manufacturing operations are focused on the improvement of distribution systems and have long been a strong tendency to optimize the distribution network in order to reduce logistics costs that the debate has become challenging. Improve the flow of materials, an activity considered essential to increase customer satisfaction. In this study, ...

full text

A HYBRID ALGORITHM FOR THE OPEN VEHICLE ROUTING PROBLEM

The open vehicle routing problem (OVRP) is a variance of the vehicle routing problem (VRP) that has a unique character which is its open path form. This means that the vehicles are not required to return to the depot after completing service. Because this problem belongs to the NP-hard problems, many metaheuristic approaches like the ant colony optimization (ACO) have been used to solve OVRP in...

full text

My Resources

Save resource for easier access later


Journal title:
مهندسی صنایع

جلد ۴۶، شماره ۲، صفحات ۱۸۵-۱۹۴

Keywords

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023